In the process of developing " the dss of army waterway transportation " an 0 - 1 integer linearity programming model of ' ' choosing ships " problem is established . the model has more than 100 variables so the traditional approaches are incapable 0 - 1規(guī)劃是一種重要的整數(shù)線性規(guī)劃模型,本文在實際開發(fā)“部隊水路輸送決策支持系統(tǒng)”的過程中,對選擇可用船問題建立了0 - 1規(guī)劃模型。
This paper also suggests an effective method of preventing premature of genetic algorithm is presented based on the analysis of causes of premature of genetic algorithms . some different local optima are found firstly and the best of these solutions is regarded as the last result . 0 - 1 integer linearity programming is an important integer programming model 另外ga在應(yīng)用中還存在早熟收斂的問題,本文介紹了解決該問題的一種策略,對一個優(yōu)化問題連續(xù)多次運行g(shù)a以求得多個不同的局部最優(yōu)解,再從這多個局部最優(yōu)解中挑選一個最優(yōu)的作為算法的最后結(jié)果,該方法可大大提高了ga求得真正全局最優(yōu)解的可能性。